Improved Sequential Stopping Rule for Monte Carlo Simulation

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Investigating to Find the Stopping Rule for Monte Carlo Computations

In this paper introduces a rule to drop the Monte Carlo computation when the accuracy of the Monte Carlo computation reaches to the amount of error which is planned in the beginning of the computation.

متن کامل

Stopping-time resampling for sequential Monte Carlo methods

Motivated by the statistical inference problem in population genetics, we present a new sequential importance sampling with resampling strategy. The idea of resampling is key to the recent surge of popularity of sequential Monte Carlo methods in the statistics and engineering communities, but existing resampling techniques do not work well for coalescent-based inference problems in population g...

متن کامل

Improved Algorithms in Monte Carlo Device Simulation

Algorithms are presented which advance the state of the art in Monte Carlo device simulation in two ways. Firstly, a method of free-flight time calculation using a new self-scattering algorithm is described. A piecewise linear total scattering rate allows for an efficient reduction of self-scattering events. Secondly, a unique Monte Carlo-Poisson coupling scheme is adopted, which converges fast...

متن کامل

Sequential Monte Carlo Samplers

In this paper, we propose a methodology to sample sequentially from a sequence of probability distributions known up to a normalizing constant and defined on a common space. These probability distributions are approximated by a cloud of weighted random samples which are propagated over time using Sequential Monte Carlo methods. This methodology allows us to derive simple algorithms to make para...

متن کامل

Sequential Monte Carlo Bandits

In this paper we propose a flexible and efficient framework for handling multi-armed bandits, combining sequential Monte Carlo algorithms with hierarchical Bayesian modeling techniques. The framework naturally encompasses restless bandits, contextual bandits, and other bandit variants under a single inferential model. Despite the model’s generality, we propose efficient Monte Carlo algorithms t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Communications

سال: 2008

ISSN: 0090-6778,1558-0857

DOI: 10.1109/tcomm.2008.070015